The problems of organizing distributed computations are considered. It is shown that the main reason for arising difficulties is an absence of adequate computational model. Dynamic automata networks (DAN) are proposed as such a model. Properties of DAN and possibilities of realizing multiprocessors with dynamic architecture based on this model are considered. Retrospective review of developing and realizing this concept from recursive computers to multiprocessors with dynamic architecture is shown.
A method for estimation of time, requiered for external events processing by distributed program applications is presented. It is shown that feasibility of such applications may depend on variation of task execution time and message delivery time. The influence of this variation shall be taken into account during feasibility checking for task chain, that participate in reaction to concrete separate external events.
1 - 2 of 2 items